Planning as Satisfiability in Nondeterministic Domains
نویسندگان
چکیده
We focus on planning as satisfiability in simple nondeterministic domains. By “simple” we mean specified in a simple extension to the STRIPS formalism allowing for specifying actions with nondeterministic effects. This allows us to simplify and extend the theory presented in (Giunchiglia 2000). The result is a planning system which, in simple nondeterministic domains, is competitive with other state-of-the-art planners.
منابع مشابه
Plan aggregation for strong cyclic planning in nondeterministic domains
Plan aggregation for strong cyclic planning in nondeterministic domains Report Title We describe a planning algorithm, NDP2, that finds strong-cyclic solutions to nondeterministic planning problems by using a classical planner to solve a sequence of classical planning problems. NDP2 is provably correct, and fixes several problems with prior work. We also describe two preprocessing algorithms th...
متن کاملASET: a Multi-Agent Planning Language with Nondeterministic Durative Tasks for BDD-Based Fault Tolerant Planning
In this paper, we introduce a multi-agent planning language called ASynchronous Evolving Tasks (ASET). The main contribution of ASET is a novel explicit representation of temporally extended tasks that may be nondeterministic both with respect to duration and effects. Moreover, ASET explicitly models the environment as a set of uncontrollable agents. We formally define ASET descriptions and the...
متن کاملFusing Procedural and Declarative Planning Goals for Nondeterministic Domains
While in most planning approaches goals and plans are different objects, it is often useful to specify goals that combine declarative conditions with procedural plans. In this paper, we propose a novel language for expressing temporally extended goals for planning in nondeterministic domains. The key feature of this language is that it allows for an arbitrary combination of declarative goals ex...
متن کاملInterleaving Execution and Planning for Nondeterministic, Partially Observable Domains
Methods that interleave planning and execution are a practical solution to deal with complex planning problems in nondeterministic domains under partial observability. However, most of the existing approaches do not tackle in a principled way the important issue of termination of the planning-execution loop, or only do so considering specific assumptions over the domains. In this paper, we tack...
متن کاملGeneralized Planning with Loops under Strong Fairness Constraints
We consider a generalized form of planning, possibly involving loops, that arises in nondeterministic domains when explicit strong fairness constraints are asserted over the planning domain. Such constraints allow us to specify the necessity of occurrence of selected effects of nondeterministic actions over domain’s runs. Also they are particularly meaningful from the technical point of view be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000